Subspace methods in object/face recognition
نویسنده
چکیده
In this paper, several new applications for subspace methods are introduced, including: (1) a subspace method used for overcoming generalization/overrtting problem for applications such as face recognition, (2) multiple subspaces constructed from the original sub-space to accommodate the inputs distorted by scaling, rotating, translating etc, and (3) a subspace framework based on which the original signal can be transformed into the subspace of a much higher dimension space through a nonlinear mapping. This nonlinear mapping provides an alternative to direct nonlinear clas-siication in the original space, that is to perform a linear classiication in this subspace.
منابع مشابه
Subspace Regression: Predicting a Subspace from One Sample
Subspace methods have been extensively used to solve a variety of problems in computer vision including object detection, recognition, and tracking. Typically, subspaces are learned from a training set that contains different configurations of a particular object (e.g., variations on shape or appearance). However, in some situations it is not possible to have access to data with multiple config...
متن کاملSubspace Regression: Predicting a Subspace from one Sample
Subspace methods have been extensively used to solve a variety of problems in computer vision including object detection, recognition, and tracking. Typically the subspaces are learned from a training set that contains different configurations or states of a particular object (e.g., variations on shape or appearance). However, in some situations it is not possible to have access to data with mu...
متن کاملVisual object recognition using probabilistic kernel subspace similarity
Probabilistic subspace similarity-based face matching is an efficient face recognition algorithm proposed by Moghaddam et al. It makes one basic assumption: the intra-class face image set spans a linear space. However, there are yet no rational geometric interpretations of the similarity under that assumption. This paper investigates two subjects. First, we present one interpretation of the int...
متن کاملPreserving Complete Subspace Structure Projection for Face Recognition
Subspace-based face recognition is one of the most successful methods for face recognition. Eigenfaces, Fisherfaces, and Laplacianfaces methods, which are based on PCA, LPP and LDA that preserve global, local and cluster structure information respectively, are three representative methods of subspace-based face recognition approaches. In this paper, we propose a novel pattern classification nam...
متن کاملEfficient Point-to-Subspace Query in $\ell^1$: Theory and Applications in Computer Vision
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in ` distance. We show in theory that Cauchy random embedding of the objects into significantlylower-d...
متن کامل